package c.j.a.d.b.n;

import java.util.LinkedHashMap;
import java.util.Map.Entry;

/* compiled from: LruCache */
public class c0<K, T> extends LinkedHashMap<K, T> {
    public int a;

    public c0() {
        super(4, 0.75f, true);
        this.a = 4;
    }

    public boolean removeEldestEntry(Entry<K, T> entry) {
        return size() > this.a;
    }

    public c0(int i, int i2) {
        super(i, 0.75f, true);
        this.a = i2;
    }
}
